- fairness control algorithm
- 合理性控制算法
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
fairness control algorithm
Look at other dictionaries:
Taxonomy of congestion control — refers to grouping congestion control algorithms according to their characteristics.Example classificationThe following is one possible classification according to the following properties: #The type and amount of feedback received from the… … Wikipedia
Max-min fairness — In communication networks and multiplexing, a division of the bandwidth resources is said to be max min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly, the second lowest data rate that a dataflow… … Wikipedia
Congestion control — This article concerns telecommunications traffic. For road traffic, see traffic congestion. Congestion control concerns controlling traffic entry into a telecommunications network, so as to avoid congestive collapse by attempting to avoid… … Wikipedia
H-TCP — is another implementation of TCP with an optimized congestion control algorithm for high speed networks with high latency (LFN: Long Fat Networks). It was created by researchers at the Hamilton Institute in Ireland.H TCP is an optional module in… … Wikipedia
TCP-Illinois — is a variant of TCP congestion control protocol, developed at the University of Illinois at Urbana Champaign. It is especially targeted at high speed, long distance networks. A sender side modification to the standard TCP congestion control… … Wikipedia
Additive increase/multiplicative decrease — The additive increase/multiplicative decrease (AIMD) algorithm is a feedback control algorithm used in TCP Congestion Avoidance. Basically, AIMD represents a linear growth of the congestion window, combined to an exponential reduction when a… … Wikipedia
Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… … Wikipedia
Scheduling (computing) — This article is about processes assignment in operating systems. For other uses, see Scheduling (disambiguation). Scheduling is a key concept in computer multitasking, multiprocessing operating system and real time operating system designs.… … Wikipedia
Unbounded nondeterminism — In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while… … Wikipedia
Maximum throughput scheduling — is a procedure for scheduling data packets in a packet switched best effort communications network, typically a wireless network, in view to maximize the total throughput of the network, or the system spectral efficiency in a wireless network.… … Wikipedia
Gerrymandering — Jerrymander redirects here. Jerrymander may also refer to the arachnid known as Solifugae. For the 2010 documentary film, see Gerrymandering (film). Part of the Politics series … Wikipedia
